The text patterns conform to the rules provided in a formal language and include many context free languages.
2.
The global index languages are a subset of the context sensitive languages, and a superset of the context free languages.
3.
Moreover, like the class of context free languages the class of visibly pushdown languages is closed under prefix closure and reversal, hence also suffix closure.
4.
If L ( A ) can be accepted by a PDA it is a context free language and if it can be accepted by a DPDA it is a deterministic context-free language.
5.
One annex was an EBNF ( Extended Backus-Naur Form, used to formally specify context free languages, enabling parsing of programming languages ) specification for OPL and another detailed OPD graph grammar.